Nuprl Lemma : const-realizable 11,40

T:Type, c:Ti:Id. es.(vartype(i;"x") T) c e@i. ("x" when e) = c 
latex


Definitionses.P(es), x.A(x), xt(x), let x,y = A in B(x;y), {x:AB(x)} , , E, t.1, x when e, R-Feasible(R), es realizer ind, Atom$n, EqDecider(T), EOrderAxioms(Epred?info), IdLnk, type List, Msg(M), left + right, Unit, , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r  s, e < e', , Top, P & Q, Knd, kindcase(ka.f(a); l,t.g(l;t) ), Type, constant_function(f;A;B), A, b, <ab>, loc(e), SWellFounded(R(x;y)), pred!(e;e'), t  T, , Id, EState(T), f(a), x:AB(x), ES, P  Q, A c B, x:A  B(x), e@iP(e), s = t, vartype(i;x), x:AB(x), Consistent(R;es), @i x initially v:T, "$x", es-realizer(p), init-p-realizable, A  B, constR{$x:ut2}(Tci), inl x , [car / cdr], Rframe(loc;T;x;L), [], Rinit(loc;T;x;v), Realizer, rec(x.A(x)), DeclaredType(ds;x), a:A fp B(a), FinProbSpace, State(ds), , {i..j}, False, Void, #$n, i  j < k, A  B, a < b, l[i], i j, i <z j, hd(l), @i(x:T), @i always.P(x), {T}, P  Q, P  Q, a = b, (x after e), loc(e), @i only events in L change   x : T, frame-p-realizable, Normal(T), tl(l), (x  l), kind(e)
Lemmasnil member, es-kind wf, l member wf, int inc rationals, normal-type wf, frame-p wf, frame-p-realizable, es-loc wf, es-vartype wf, assert-eq-id, init-p-implies, es-invariant1, top wf, le wf, bool wf, decl-state wf, finite-prob-space wf, decl-type wf, IdLnk wf, Knd wf, fpf wf, Id wf, unit wf, select member, Rinit wf, es realizer wf, Rframe wf, rationals wf, R-sub-Rlist, es-realizer wf, init-p wf, es-real wf, event system wf, init-p-realizable, R-sub-implies, es-real-implies, constant function wf, val-axiom wf, es-when wf, alle-at wf, implies-es-real, constR feasible

origin